Palindromic rich words and run-length encodings
نویسندگان
چکیده
We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.
منابع مشابه
Combinatorial properties of smooth infinite words
We describe some combinatorial properties of an intriguing class of infinite words connected with the one defined by Kolakoski, defined as the fixed point of the run-length encoding∆. It is based on a bijection on the free monoid over Σ = {1, 2}, that shows some surprising mixing properties. All words contain the same finite number of square factors, and consequently they are cube-free. This su...
متن کاملIdentifying Variable Length Multi-pair Palindromic Patterns with Errors in a DNA Sequence
The emphasis in genome projects has moved towards sequence analysis in order to extract biological “meaning”(eg., evolutionary history of particular molecules or their functions) from the sequence. Especially, palindromic or direct repeats that appear in a sequence has biophysical meaning [16]. A problem is recognizing interesting patterns and configurations of words (strings of characters) ove...
متن کاملModified Padovan words and the maximum number of runs in a word
A run (or maximal periodicity) in a word is a periodic factor whose length is at least twice the period and which cannot be extended to the left or right without changing the period. Recently Kusano et al. [6] used a clever search technique to find run-rich words and were able to show that the number of runs in a word of length n can be greater than 0.94457564n. In this paper we use a two-stage...
متن کاملOn Highly Palindromic Words
We study some properties of palindromic (scattered) subwords of binary words. In view of the classical problem on subwords, we show that the set of palindromic subwords of a word characterizes the word up to reversal. Since each word trivially contains a palindromic subword of length at least half of its length—a power of the prevalent letter—we call a word that does not contain any palindromic...
متن کاملPalindromic Richness
In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are ‘rich’ in palindromes in the utmost sense. A characteristic property of so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author toget...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 116 شماره
صفحات -
تاریخ انتشار 2016